|
In mathematics, Laver tables (named after Richard Laver, who discovered them towards the end of the 1980s in connection with his works on set theory) are tables of numbers that have certain properties. == Definition == For a given a natural number ''n'', one can define the ''n''-th Laver table (with 2''n'' rows and columns) by setting :, where ''p'' denotes the row and ''q'' denotes the column of the entry. Define : and then calculate the remaining entries of each row from the ''m''-th to the first using the equation : The resulting table is then called the ''n''-th Laver table; for example, for ''n'' = 2, we have: There is no known closed-form expression to calculate the entries of a Laver table directly.〔. See slide 8/33.〕 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Laver table」の詳細全文を読む スポンサード リンク
|